Reasoning About Space: The Modal Way
نویسندگان
چکیده
We investigate the topological interpretation of modal logic in modern terms, using a new notion of bisimulation. We look at modal logics with interesting topological content, presenting, among others, a new proof of McKinsey and Tarski’s theorem on completeness of S4 with respect to the real line, and a completeness proof for the logic of finite unions of convex sets of reals. We conclude with a broader picture of extended modal languages of space, for which the main logical questions are still wide open.
منابع مشابه
HyLMoC A Model Checker for Hybrid Logic
The current technological trend depicts a scenario in which space, and more generally the environment in which the computation takes place, represents a key aspect that must be considered in order to improve systems context awareness. Reasoning about such context can be interpreted as spatial reasoning, which means not only to be able to carry out inferences about the space itself, but also inf...
متن کاملThe topo-approach to spatial representation and reasoning
Commonsense knowledge about the surrounding physical world and quantitative theories of space, such as metric geometry, can be viewed as two extremes on how human beings relate to space. Qualitative spatial representation and reasoning places itself in between these two approaches. Qualitative spatial reasoning is a set of high-level theories which abstract from the quantitative details and att...
متن کاملReasoning about Hybrid States
In this paper, we present a new semantics for the well-known normal system of modal logic K based on the notion of convergence spaces. The purpose is to use convergence spaces to model and reason about systems with both discrete and continuous states, so-called hybrid state spaces. K is sound and complete with respect to the class of convergence space models, and we show that Kripke frames and ...
متن کاملReasoning on Assembly Code using Linear Logic
We present a logic for reasoning on assembly code. The logic is an extension of intuitionistic linear logic with greatest fixed points, pointer assertions for reasoning about the heap, and modalities for reasoning about program execution. One of the modality corresponds to the step relation of the semantics of an assembly code interpreter. Safety is defined as the greatest fixed point of this m...
متن کاملCoLoSS : The Coalgebraic Logic Satisfiability Solver ( System Description ) Georgel Calin
CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 13 شماره
صفحات -
تاریخ انتشار 2003